range searching造句

• The range searching problems and data structures are a fundamental topic of computational geometry.
• The same range minimization problem may also be given an alternative interpretation in terms of two dimensional range searching.
• The range searching problem finds applications not only in areas that deal with processing geometrical data ( like CAD ), but also in databases.
• For example, the range searching problem may be converted into the dynamic range searching problem by providing for addition and / or deletion of the points.
• For example, the range searching problem may be converted into the dynamic range searching problem by providing for addition and / or deletion of the points.
• While I presume no impropriety in Penwhale's complaint, it becomes impossible not to contemplate a range searching questions which need to be addressed in an effort to bring a better sense of balance to ArbCom's flawed presumptions, flawed procedures and flawed process.
• In its most general form, the "'range searching "'problem consists of preprocessing a set " S " of objects, in order to determine which objects from " S " intersect with a query object, called a " range ".
• Skytree has machine learning methods that include : random decision forests, kernel density estimation, K-means, singular value decomposition, gradient boosting, decision tree, 2-point correlation, range searching, K-nearest neighbors algorithm, linear regression, support vector machine, and logistic regression.